Designing Theory Solvers with Extensions Andrew Reynolds1 , Cesare Tinelli1 , Dejan1 Jovanovi´c3 , and Clark Barrett2 1 Department of Computer Science, The University of Iowa Department of Computer Science, Stanford Uni

Source URL: csl.sri.com

• Theoretical computer science
• Mathematics
• Mathematical logic
• Logic in computer science
• Automated theorem proving
• Electronic design automation
• Formal methods
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Substitution
• Model theory

Remy Goldschmidt Education 2014–2018 Bachelor of Science in Computer Science, University of Illinois at Urbana-Champaign. Work Experience Summer 2017 Software Engineering Intern, Awake Networks.

Source URL: taktoa.me

• Software engineering
• Computer programming
• Programming language theory
• Functional languages
• Programming paradigms
• Haskell
• Literate programming
• Functional programming
• OCaml
• Bachelor of Computer Science
• Conditional

© The AuthorPublished by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: Advance Access published on May

Source URL: www.dcs.ed.ac.uk

• Statistical randomness
• Queueing theory
• Mathematics
• Markov models
• Probability theory
• Process calculi
• PEPA
• Markov processes
• Markov chain
• Product-form solution
• Balance equation
• Jane Hillston

Probabilistic Model Checking of Contention Resolution in the IEEELow-Rate Wireless Personal Area Network Protocol Matthias Fruth School of Computer Science, University of Birmingham, Edgbaston, Birmingham, B15

Source URL: qav.comlab.ox.ac.uk

• Media access control
• IEEE 802
• Computing
• Data transmission
• Ethernet
• Wireless networking
• IEEE 802.15.4
• Carrier-sense multiple access with collision avoidance
• Carrier-sense multiple access
• Medium access control
• Zigbee
• Exponential backoff

The University of York Department of Computer Science Programming Languages and Systems Group Unfailing Haskell Qualifying Dissertation

Source URL: community.haskell.org

• Software engineering
• Computer programming
• Declarative programming
• Functional languages
• Functional programming
• Recursion
• Higher-order functions
• Programming language comparisons
• Haskell
• Lazy evaluation
• ML
• Conditional

James Caldwell Department of Computer Science University of Wyoming Laramie, WYDATE: October 31, 2016

Source URL: www.cs.uwyo.edu

• Automated theorem proving
• Theoretical computer science
• Computing
• Mathematics
• Nuprl
• Interactive Theorem Proving
• Proof assistant
• Robert Lee Constable
• ACL2
• Formal methods
• Computer science
• Automated reasoning

TimeMachine: Timeline Generation for Knowledge-Base Entities Tim Althoff*, Xin Luna Dong† , Kevin Murphy† , Safa Alai† , Van Dang† , Wei Zhang† *Computer Science Department, Stanford University, Stanford, CA 94

Source URL: www.timalthoff.com

On Frequency LTL in Probabilistic Systems Vojtěch Forejt1 and Jan Krčál2 1 2 Department of Computer Science, University of Oxford, UK

Source URL: qav.comlab.ox.ac.uk

• Temporal logic
• Theoretical computer science
• Model checking
• Finite automata
• Linear temporal logic
• Mathematical logic
• Formal languages
• Mathematics
• Bchi automaton
• Omega language
• Markov decision process
• Computation tree logic

Timothy Alden Davis Department Computer Science and Engineering Texas A&M University 3112 TAMU, College Station, Texasemail: web: http://faculty.cse.tamu.edu/davis

Source URL: faculty.cse.tamu.edu

Dilian Gurov’s CV Professional preparation   PhD in Computer Science, 1998, Dept. of Computer Science, University of Victoria, Canada.

Source URL: www.nada.kth.se

• Software testing
• Software verification
• KTH Royal Institute of Technology
• Computer science
• Verification
• Electromagnetism
• Engineering